Mean-Payoff Games and Propositional Proofs
نویسندگان
چکیده
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the value of the game is negative the formula has a polynomial-size refutation in Σ2-Frege (i.e. DNF-resolution). This reduces mean-payoff games to the weak automatizability of Σ2-Frege, and to the interpolation problem for Σ2,2-Frege. Since the interpolation problem for Σ1-Frege (i.e. resolution) is solvable in polynomial time, our result is close to optimal up to the computational complexity of solving mean-payoff games. The proof of the main result requires building low-depth formulas that compute the bits of the sum of a constant number of integers in binary notation, and lowcomplexity proofs of the required arithmetic properties.
منابع مشابه
A Parity Games and Propositional Proofs
A propositional proof system is weakly automatizable if there is a polynomial time algorithm which separates satisfiable formulas from formulas which have a short refutation in the system, with respect to a given length bound. We show that if the resolution proof system is weakly automatizable, then parity games can be decided in polynomial time. We give simple proofs that the same holds for de...
متن کاملAn Introduction to Proofs of Determinacy of Long Games
We present the basic methods used in proofs of determinacy of long games, and apply these methods to games of continuously coded length. From the dawn of time women and men have aspired upward. The development of determinacy proofs is no exception to this general rule. There has been a steady search for higher forms of determinacy, beginning with the results of Gale–Stewart [2] on closed length...
متن کاملSimple Stochastic Games, Parity Games, Mean Payoff Games and Discounted Payoff Games Are All LP-Type Problems1
We show that a Simple Stochastic Game (SSG) can be formulated as an LP-type problem. Using this formulation, and the known algorithm of Sharir and Welzl [SW] for LP-type problems, we obtain the first strongly subexponential solution for SSGs (a strongly subexponential algorithm has only been known for binary SSGs [L]). Using known reductions between various games, we achieve the first strongly ...
متن کاملDeterminacy Proofs for Long games
1. Preliminaries: (a) The games. (b) Extenders, iteration trees. (c) Auxiliary game representations. (d) Example: Σ 1 2 determinacy. 2. Games of length ω · ω with Σ 1 2 payoff. 3. Continuously coded games with Σ 1 2 payoff.
متن کاملA TRANSITION FROM TWO-PERSON ZERO-SUM GAMES TO COOPERATIVE GAMES WITH FUZZY PAYOFFS
In this paper, we deal with games with fuzzy payoffs. We proved that players who are playing a zero-sum game with fuzzy payoffs against Nature are able to increase their joint payoff, and hence their individual payoffs by cooperating. It is shown that, a cooperative game with the fuzzy characteristic function can be constructed via the optimal game values of the zero-sum games with fuzzy payoff...
متن کامل